全文获取类型
收费全文 | 531篇 |
免费 | 186篇 |
国内免费 | 30篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 6篇 |
2021年 | 13篇 |
2020年 | 12篇 |
2019年 | 12篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 38篇 |
2015年 | 34篇 |
2014年 | 72篇 |
2013年 | 65篇 |
2012年 | 47篇 |
2011年 | 54篇 |
2010年 | 37篇 |
2009年 | 39篇 |
2008年 | 36篇 |
2007年 | 37篇 |
2006年 | 29篇 |
2005年 | 33篇 |
2004年 | 26篇 |
2003年 | 14篇 |
2002年 | 14篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 11篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
排序方式: 共有747条查询结果,搜索用时 15 毫秒
61.
刘艳琴 《兵团教育学院学报》2003,13(2):43-45
在新形势下,我国高校发生了一系列重大变化,学生管理模式必须进行相应的改革,其主要表现在以下三个方面:树立“以学生为本”的理念,强化服务意识;搜索管理盲点,改革管理体制;注重管理人员的素质,加强学生管理队伍的建设。 相似文献
62.
We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
63.
64.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
65.
66.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
67.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
68.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
69.
侯新华 《兵团教育学院学报》2001,11(1):60-61
教学中指导学生正确使用数学符号、正确运用基本概念、正确运用函数图象以及探索解题思路等 ,可以提高成人《高等数学》的教学质量 ,也可以提高统考的及格率 相似文献
70.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献